Scalable search system using human searchers

ABSTRACT

A system allowing a query to be submitted to a server that locates a human searcher to perform a search. The searcher performs a search including using conventional tools, browser, and provides results to the user. A searcher who produces result(s) accepted by the user is rewarded and the results can be used when a similar query is submitted by another user. The searcher is located by comparing keywords of the query to keywords for which the searcher has registered and a high ranking searcher may be chosen by the system based on various factor(s). While the search is performed, information including videos, games, advertisements, etc., may be provided to the user based on keywords of the query and selection by the searcher. The reward for the searchers can be based on revenue from advertisements.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention is directed to a system that utilizes humansearchers to perform searches for users in real-time to provide highlyrelevant results from a broad base of knowledge which includes the “DeepWeb”, herein defined as that part of the web's vast amount ofinformation that is still not commonly indexed by current searchengines. Using this unique invention, users have access to a vast bodyof information or knowledge, from anywhere at anytime, offered in a waythat makes it easy to find desired information quickly. The system maybe accessed via text- or speech-based devices such as desktop computers,laptops, cell phones, telephones, and personal digital assistants. Theuser and searcher may communicate directly during the search process inorder to provide much better results to the query. Searchers aremotivated to participate because they may be compensated for providingtimely and relevant results.

2. Description of the Related Art

In the current search environment a user can access a search engine,such as Google™ and perform a search. However, many users struggle withformulating a set of keywords that will result in the search engineobtaining useful results. (The term “keyword” includes one or morekeywords and keyphrases that can include multiple keywords as well asnatural language sentences that can be analyzed to extract keywords andkeyphrases). Also, while there are already more web pages indexed thanthe world's population, it is estimated that less than 1% of allinformation is indexed by any given search engine.

Current search engines are very difficult to use on devices such ascellular telephones (cellphones) because the top search results areoften not relevant to what the user really desires to know, forcing theuser to look through a long set of listing results or to repeat queriesin order to get more relevant results. Cellphone users are sometimesfrustrated by the limited display capability and awkward input methodsof cellphones, which further complicates the search function when usinga cellphone.

Attempts have been made to have humans answer users' questions via avariety of mechanisms including via email, via information posted atwebsites, and via library reference desks that are connected to usersvia “chat” sessions. However, there are many limitations imposed bythese and other offerings including having limited pools of “experts”,having latency in delivering results, having helpers who are notsufficiently knowledgeable to provide optimal results, etc.

There are many advertising-based models on the web that have been triedwith “search” applications, including ones that “target” the user bymapping advertisements to keywords based on keywords in a user's query.

What is needed is a widely accessible system that allows informationseekers to find highly relevant information from a broad base ofknowledge, offered in a way that one can find what one wants easily andquickly, from anywhere at anytime. Also needed is a business processthat enables such a system to be sustainable.

SUMMARY OF THE INVENTION

It is an aspect of the present invention to provide a system thatimproves the experience of the user during a search, including providinghighly relevant answers, by using human involvement in determiningrelevancy so that humans may sort and select results from traditionalsearch engines and/or access information outside the domain of currentsearch engines.

It is an aspect of this invention to overcome some of the currentlimitations of machine intelligence by providing an infrastructure thatenable human searchers to provide better results to users who needanswers to their questions or search queries.

It is an aspect of the invention that the human searchers may provideinformation to users that is available from traditional search enginesand provide information that is beyond what is currently available viatraditional search engines. Items from the “Deep Web” that may not beindexed by traditional search engines, may be “found” by searchers andreported to end users. These items might come from searcher's harddrives, intranets, a personal bookshelf, of from sites such as stores(e.g. Amazon) or auction sites (e.g. eBay).

It is also an aspect of the invention to provide a system thatdetermines, in real-time, searchers capable of finding highly relevantanswers to a user's query by having human searchers “sign up” in advancefor particular keywords, or categories thereby enabling searchers to beprepared to answer queries relating to said keyword, or category.

It is an aspect of the invention to link users with searchers inreal-time in an interactive and collaborative way so that the user canaccess high-quality and rapid help, getting the answer that he or sheneeds, where this may be accomplished via a chat session or by linking auser with a searcher via a speech- or text-enabled connection so thatclarification may be sought and/or provided regarding the query, etc.

It is also an aspect of the invention that a searcher has a very richtoolset for performing rapid searching in a particular keyword area.

It is an aspect of the invention to have advertisements presented tousers to generate revenues that enable the service to be self-sustainingwithout necessarily charging users for access to the service.

It is also an aspect of the invention that searchers can be compensatedfor their work so that there is a high degree of motivation to have alarge pool of searchers available at all times on a wide range oftopics.

It is also an aspect of the invention that compensation may be gifted tocharities.

It is also an aspect of the invention that a speech capability isincluded so that the system can be accessed not only from computers butalso through mobile phones and landline telephones and where speech maybe transcribed into text in order for appropriate searchers to beconnected to users.

It is also an aspect of the invention that large and small bonuses maybe given to searchers who perform well with providing relevant answersin a timely manner.

It is also an aspect that some searchers will hand-select in real-time,advertisements that will be displayed for the end user. Theseadvertisements may relate to keywords of the search phrase. Advertisersmay bid to determine their exposure level to the human searchers and/orto the end user.

It is an aspect of the invention that advertisements may be provided tousers and/or searchers in a highly targeted way.

It is an aspect of the invention that searchers submit their billing andpersonal information to the system so that the system can keep track oftheir availability, their profile, a method of compensating them, theirkeywords for which they are signed up to search, etc.

It is a broad and general aspect of the invention that real-timehuman-assisted search services on the Internet may be compensated for bydisplaying advertisements to end users while the search is beingcompleted.

It is also an aspect of the invention to have methods of disabling,suspending, and/or neutralizing users and/or searchers who areattempting to stop, harm, or disrupt the system.

It is an aspect of the invention that searchers are assigned to users insuch a way that searchers who have a proven track record are prioritizedto perform searches for end users. A self-selecting “Darwinian” modelmotivates searchers to perform well. Users have an opportunity toinfluence the rating of the searcher.

It is an aspect of the invention that this system provides a default wayto get results for users when human searchers are not available or whenhuman searchers are not performing sufficiently fast or producingsufficiently relevant results where these “last resort” answers may beprovided by relaying the query to traditional search engines andreturning results to users, similar to the operation of meta-searchengines in which users may be able to pick the default search engine touse as the “default” solution.

The above aspects can be attained by a system that allows a query to besubmitted by a user and locates a human searcher who can perform asearch on the query in real-time. The searcher performs a search usingconventional and expanded search tools and provides the results to theuser through the system. A searcher who produces a search accepted bythe user is rewarded (e.g. with points and/or money or otherconsideration). The query and results can be stored for later use whenanother user submits a similar query. The searcher is located bycomparing keywords of the query to keywords for which the searcher hasindicated he/she will do searches. The searcher chosen by the system isone that ranks well in the keywords of the query that match to keywordsregistered by the searcher, prior successful searching by the searcher(for this specific keyword and/or in general), speed of producing searchresults for users during past searches, and other factors that help toprovide a quality search and experience for the user. While the searchis being performed, the user is mentally engaged by information providedto the user, such as advertisements, chat session with the searcher,videos, games, etc. The information presented to the user while thesearcher is conducting a search on the user's behalf can be based onkeywords of the query and designated by the searcher who performs thesearch. For example, there may be advertisements that are related tokeywords that are displayed for the user. The searcher might even pickthe advertisement that shows up on the user's computer, telephone, orother device. A variety of revenue schemes may be employed to optimizereturns from the additional capability of having a human helping todecide what advertisement is most appropriate based on the form of thequery.

These together with other aspects and advantages which will besubsequently apparent, reside in the details of construction andoperation as more fully hereinafter described and claimed, referencebeing had to the accompanying drawings forming a part hereof, whereinlike numerals refer to like parts throughout.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a system architecture embodiment.

FIG. 2 shows operations associated with reviewing prior queries.

FIG. 3 depicts finding a searcher.

FIG. 3A illustrates how a searcher is picked.

FIG. 4 illustrates search result processing.

FIG. 5 shows query clarification operations.

FIG. 6 depicts a user GUI (graphical user interface).

FIG. 7 depicts a searcher GUI.

FIG. 8 illustrates a database.

FIGS. 9A, 9B, and 9C show different phases of the user GUI during asearch session.

FIGS. 10A-10E show a searcher GUI during a search session

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The embodiments of the present invention include a system 100 thatallows queries by users or information seekers (InfoSeekers™), such as aworker, a housewife or a child, to be searched by human searchers, whomay be professional paid searchers (PaidSearchers™) as well as amateurand/or volunteer searchers. For example, the query (which, throughoutthis description, may entail a fully-formed question/sentence or akeyword or a list of keywords or a search phrase as previouslydiscussed) might request, for example, the closing time of a particularrestaurant, the winner of the 1960 World Series, or informationregarding a medical illness (or any other type of query). As depicted inFIG. 1, the queries can originate from user computer systems 102-106 andare received over a communication system 107 or from telephone handsets110-112. The user computer systems can be a typical desktop or laptopsystem, a handheld computer such as a personal digital assistant (PDA),a basic cellular telephone, a text-enabled cellular telephone, aspecialized query terminal, or any other source that allows a user toenter a query via text or speech entry. (Note: the words “speech” and“voice” are used interchangeably in this discussion). The telephonehandsets can be typical touch-tone telephones, cellular telephones,two-way radios or any other communication device that allows the user totalk over a distance. The communication system can include packetswitched facilities, such as the Internet, circuit switched facilities,such as the public switched telephone network, radio based facilities,such as a wireless network, etc.

The oral speech queries by telephone 110-112 are stored in the systemdatabase and converted into digital text queries by a speech translationsystem 114. (Alternatively, the user's computer 102-106 or telephone110-112 may perform this processing). The speech translation system 114handles the task of translating the speech into text, possibly byinteraction with other systems, or it may perform the task locally. Itmay perform speech to text conversion by using either speechtranscription using human transcribers or using conventionalspeech-to-text processing, also known as automatic speech recognition(ASR). The speech queries can originate from a user's telephone and canbe handled initially via automated attendant speech prompt typeprocessing (or alternatively, via an interactive speech response or IVRsystem) to obtain the user's query.

The speech translation server 114 keeps track of the port from which thecall originated and assigns a user identifier to the user 110-112 onthis port for a particular session. The system 114 can prompt the userto speak the query. The speech queries can also originate from anothersource 116 called a “speech query service requestor” (SQSR) rather thandirectly from the user, such as a private or public informationprovider. For example, a speech query can be initially processed by apublic library telephone system and switched to the server 114. Thespeech query may physically arrive at the system via a variety of inputmeans, including time-division multiplexed lines, voice over IP (VOIP)packets from an Internet connection, and other sources. The speech querymay arrive as a stream or packet or series of packets.

Similarly, a commercial site, such as a grocery store ordering systemwhere a user orders food and inquires about recipes for a specialafter-dinner dessert can initially process a speech query and pass italong to the speech translation server 114.

The SQSR 116 may communicate with the speech translation server 114 viaa variety of mechanisms including an IP-based socket address or via aMicrosoft .NET service, making the translation services of 114 widelyavailable via the Internet to any application that wishes to use them.

The packet can then be processed locally at the speech translationserver 114 to convert it from digitized speech into text or,alternatively, it may be processed by a remote system. If the digitizedspeech is being transcribed by human transcribers, this can beaccomplished by sending the digitized speech to one or more transcribersystems (TS) 130-132 where human transcribers can hear the speech, forexample via headphones or speakers, and transcribe the information bytyping the text into their system, so that the text is then sent back tothe speech translation server 114 (or alternatively, directly to thequery server 118 or to the SQSR 116), all within a matter of seconds(preferably less than 10 seconds after the user has finished speakingthe query). To speed up processing, the speech query can be andtypically is preferably broken up into a stream of packets and passed tothe transcriber, without interruption, as it is being spoken by theuser, thereby allowing for reduced latency in the system. Preferably,there are many more transcribers available in the system than there areinstantaneous queries so that delays are not induced into the system. Inthe case of an overflow of queries, a form of flow control may beutilized by telling some callers that they must hold on the line for anavailable transcriber (which might be described to the caller as holdingfor an operator or agent). Preferably, the speech translation server 114maintains a database of all transcribers that are currently logged-inand available to perform the service of transcription using atranscription software application on their transcription system130-132. Alternatively, this function of tracking the availability oftranscribers might be located on a remote system and/or might beimplemented using a distributed mechanism among transcriber systems130-132 (for example, using P2P mechanisms).

The speech translation server 114 may feed continuous sequential speechphrases from various and different sources (e.g. users) to any giventranscriber 130. Hence, the transcriber is sequentially transcribing, inrapid succession, speech messages from various speakers and creatingseparate text packets that are associated with each speech message.

Once the query is in digital text form, it is provided to the queryserver 118. The text entry features of cellular telephones can also beused to enter a query in digital text form allowing users to submitqueries textually from telephones.

Queries from a graphical user interface (GUI) of the user computers102-106 can originate directly from the user, or like the speechqueries, indirectly through a TQSR (Text Query Service Requestor) 120,which may be any software application or device connected via theInternet, for example. As in the speech query, a user may be on agrocery store web site ordering food for delivery and may inquire abouta recipe for a special dessert. This recipe query would be forwarded tothe query server 118. Any web site, consumer electronics device, orother device may become a TQSR or SQSR for performing a search. Forexample, a set top box offered by a satellite TV or Cable TV providercould offer the ability to enter a query string and act as a TQSR orSQSR. Any software application running on a PC, such as Microsoft's Wordor Excel, may also serve as a TQSR or SQSR.

An appropriate interface, such as a graphical user interface (GUI) forthe computer 102 or speech prompt system in the speech translationsystem 114 extracts a query from the user and transmits the query to thequery server 118.

Upon the receipt of a query, such as from user computer 102 in thisexample, the query server 118 can provide information (e.g.advertisements) to the user for the user to see or hear while the searchis being processed. This information can be related to the query (or tothe keywords of the query) and may include visual and audio informationas appropriate for the user's device and for the source of the query,such as a grocery store ad in the recipe example. This information caninclude not only advertisements, but also information such as video,music, games, web links, etc. that will interact with and display forthe user while the search is being performed. The information providedmay serve as a source of revenue, for example through advertising. Ifthe user views an ad, or clicks on a link, or purchases a product(sometimes referred to as “conversion”) related to an advertisementwhile awaiting results of a search, the database can be updated toreflect additional ad revenue with a credit of points and/orcompensation, if appropriate, to the searcher. A digital text, graphics,audio, or video advertisement may be displayed (or played) on a usercomputer 102 or on a user telephone (112). The particular advertisementselected is or can be based on a weight associated with theadvertisement based on single or combined factors such as advertisercontract commitments, bidding price of advertisers, popularity withusers, keyword mapping to advertisements, statistical usage (e.g. leastrecently presented), user demographics, searcher choice ofadvertisement, etc.

The server 118 processes the arriving queries by determining whichsearchers are available to search for the information being requested,based upon factors such as the searcher being logged in, searchers whoare signed up for a keyword, or category, or the ranking of the searcherbased on previous performance.

The server can also determine if this particular query has been queriedpreviously and can send a response to the user with previously obtainedsearch results without necessarily invoking a human searcher.

When no previous query results satisfying, or that may satisfy thequery, are available, the server 118 sends the query to one or more ofthe available searchers over the communication system 107. If the queryis a speech query, in addition to sending the text version of the queryand the keywords, the speech recording of the query can be transmitted.The human searchers can be located at computer-based searcher toolsystems 122-124 and/or speech-enabled computer-based searcher systems126-128.

A server-chosen searcher (or searchers) reviews the query, including thekeywords and any speech recording and decides whether to accept thesearch. When the searcher accepts the search task, this acceptance maybe communicated back to the user who originated the query through theserver 118. This may happen automatically or manually. Because somesearches may require additional information or clarification, thesearcher can send a request for additional information to the user. Thiscan be sent through server 118 or via direct link to the user via thecommunication system 107. The user replies with a clarification,additional information or a revised query. The searcher then uses thesearcher tool system 122-128 to perform a search of publicly orprivately available information to produce search results. For example,the searcher may use conventional tools, such as a browser, to accesspublic databases via searches over the World Wide Web or privatedatabases that may be accessible only to the searcher, such as adatabase of information previously gathered by the searcher, or fromresults stored on the query server 118 from other searchers, or fromdatabases that require payment for access or even information availableto the searcher in non-electronic form, such as a book on the searcher'sbookshelf, test results from a personal experiment, etc. The searchermay also submit the search query, or some version of it to an automatedsearch tool such as the Google or AskJeeves systems. The search results,such as an answer, comments by the searcher, web pages, web links, andother query related information, etc. are gathered by the searcherduring the search. The results of the search, such as web pages andlinks which the user can review or use to obtain the informationdesired, an answer to a question and web pages or links to web pagesthat support the answer, etc., is transmitted back to the user throughthe server 118 or directly to the user via the communications system107. The information returned is typically what the searcher thinks orintends can satisfy the need of the user. The information can includeanything that could satisfy the user, including a document, a video, asong, a configuration file, pictures, links, etc.

The results are presented to the user in real-time, associated with theamount of time it takes to find a searcher and do the search. One ormore available searchers are preferably identified within 1-15 secondsand the searcher preferably begins the work of performing the searchwith 1-15 seconds. Depending on the search, the accumulation of relevantresults may generally take from a few seconds to a few minutes. Theserver or search tool may interact with the user automatically everyapproximately 6 seconds via the chat session (or via the VOIPconnection) in order to identify to the user that progress is beingmade. This might be as simple as a dot typed on the user's screen or amore detailed automated text message. When on a telephone, the user willpreferably be hearing or watching an advertisement, but during silentperiods, the user interaction may occur via speech such as having thesearcher or an automated speech system say, “Please continue to holdwhile your search is being performed”. The searcher may interact withthe user, either of his or her own accord or the searcher tool mayremind the searcher to give status to the user. The searcher may alsosend partial results to the user so that the user may begin to previewresults. The server 118 stores the query phrase and the search resultsfor matching with future queries.

When the user is at a telephone 110, there are several ways in whichresults may be returned to the user from the searcher. The results maybe conveyed over a real-time VOIP or circuit-switched connection betweenthe user and the searcher. Combined with these speech results, otherresults may be sent to the telephone via a text-messaging system such asSMS. These other results may be in the form of text, graphics, URLs,audio, or video. The results can be an audio message recorded by thesearcher and played to the user. Alternatively, the searcher's messagemay refer the user to sources where the user can obtain the answer. Theresults of the searcher can alternatively be digital text that has beenconverted into audio and played to the user. The results can be an audiomessage concerning where the digital results, or some other type ofresults, can be found that are accessible to a user. Text results may beplayed to the user using speech synthesis or speech reading, as is donewith audiobooks. The text may be read aloud in real-time by the same (ordifferent) resources (e.g. the transcribers described above) that arebeing used to transcribe speech to text. It is possible to utilize thenetwork of searchers 122-128 to perform either transcription of speechto text or the reverse process of converting text to speech. Thedatabase can keep track of which searcher resources are capable ofproviding either of these services, potentially with compensation forsaid services. Although not preferred, in circumstances where needed theresults can be provided by postal service or other courier.

The user at computer 102 or telephone 110 reviews the search results andthen does or does not “accept” the results. An acceptance can be in theform of the user moving on to some other pursuit (e.g. logging off ofthe search site or leaving the system idle), the user actually providingan acceptance by activating (“clicking-on”) an acceptance button on theuser GUI, the user responding to a request for a user response, such asa pop-up or voice prompt, transmitted to the user computer 102 ortelephone 110 by the server 118, the user entering a revised, differentor follow-up query, or some other action that indicates the user issatisfied or otherwise found the results useful. The user can registerdissatisfaction with the query results by requesting that anothersearcher perform the search again (typically with the exact same searchterms or query), by activating a “try again with same search terms”button or a rejection button on the user GUI, by responding to a requestfrom the server 118, by responding to a voice prompt, or by some otheraction from the user that indicates dissatisfaction or the desire to“get a second opinion”. If the user requests that the search beperformed again or expresses dissatisfaction, the system server 118provides the user's query to a new searcher or searchers.

When the search is accepted or rejected, a searcher database in server118 is updated to reflect the success rate of the searcher. The numberof successful searches (accepted, or not rejected, by the user) for eachsearcher and the ratio of successful versus total searches for eachsearcher can be used at an appropriate time to reward the searcher. Thereward may be dependent upon other factors such as transferring a queryto another searcher, sending advertisements to users, spendingadditional time on a search, transcribing voice to text, dictating textto voice, or working with particular categories, or keywords.

When a query, which can be a natural language query (e.g. a fully-statedquestion) or a set of keywords, is transmitted by the source (102, 114,or 120), the server process 150 (see FIG. 2) running on query server 118receives and updates 151 the database 156 with the query, and source IPaddress. It is also possible to store other information about the user,such as address, name, etc. for dialogues with the searcher when needed.The server parses the query and generates 152 a set of search keywordsthat may be looked up in the keyword database. For later correlation ofthe user, query and the keywords, these may also be linked in thedatabase. In the keyword database, a weighting can be attached to eachkeyword that determines how influential it is in determining what groupof searchers to pick from. At the time that the query is received, theserver can also send information, such as an advertisement, to the usercomputer 102 for display thereon. The advertisement can be linked to oneor more of the keywords of the query. The advertisement canalternatively be chosen randomly from an advertisement database. Theinformation sent to the user can also indicate that the system is“finding a searcher”. It is also possible to delay the sending of anadvertisement until an appropriate searcher is chosen. That searcher mayhave the option to choose the advertisement that is sent to the user,which might be based upon the query and/or keywords and/or thesearcher's assessment of which advertisement to send. This advertisementchoice may be accomplished by the searcher predefining whichadvertisement(s) should be played for a user that is sent to a givensearcher for a particular keyword.

The parse operation can also check the query to see if it is a follow-onquery to a previously submitted query by this user during this session,for the purpose of having the same searcher handle a follow-on queryfrom the user. This can be determined by checking whether the user haspreviously received search results in this session and comparingkeywords of the previous query to the current query, or by examining afollow-on query flag set by the user's browser or search application ifthe user chooses to elevate the status of a particular searcher (e.g. byclicking a button that says, “If possible, give me this searcher againif I search in this topic area”). Cookies may be used to store keywordand searcher information on the user's computer or device given that theserver may not know the identity of the user. If so, the database 156can be updated to link the query to the searcher that handled the priorquery or preferably to set the rank of this searcher to the highestvalue temporarily for that user and for a given keyword. If users becomemore comfortable identifying themselves when searching, then the servercan perform the function of linking user and searcher if the user and/orsearcher make such a request for a continued connection. As an incentiveto the user to provide identifying information such as name, user ID,email address, etc., this option of getting repeat service fromwell-performing searchers can be offered as an option to the user.

The query is then matched 154 to the previous queries stored in database156. This database 156, among other things, stores the previous queries(or a subset of previous queries, such as the ones that are stillconsidered relevant to this user, wherein said relevance might pertainto time, location, or subject matter), the corresponding keywords thatresulted from the previous queries and the accepted “relevant” resultsassociated with the corresponding keywords and queries. This matchingcan compare the keywords of the current query with the keywords ofprevious queries for an exact, partial or fuzzy (highly similar) match.This can result in several previous queries matching the current query.If a match does not occur, the process associated with finding asearcher to perform a search continues (see FIG. 3).

If an exact match occurs 154 the system proceeds 162 to obtain andprovide 164 the user with the corresponding search results and possiblya new advertisement (prior to delivering these results or alternately,concurrently to delivering the results.

If it is a fuzzy or partial match, a number of the closest matchingprevious query phrases, such as the top three, can be transmitted 158 toand displayed for or spoken for the user. The system can also send a newadvertisement to the user and await a reply from the user as to whetherany of these query phrases are an acceptable substitute for theircurrent query. If the user's reply 160 (for example by clicking on a GUIbutton or cellphone key to indicate the user wishes to proceed with theoriginal phrasing of the query) indicates that none of the “matching”queries is preferable to the user over the user's original query, thenthe process associated with finding a searcher to perform a searchcontinues 192.

If the user has selected 160 one of the queries as a substitute fortheir query, the system obtains 162 the results from the database 156and transmits 164 the results to the user without delay (or the systemcan be configured to present an ad sometimes or always). If the resultsare accepted by the current user (i.e. considered relevant again), thesearcher who produced the results is given additional credit, which isstored in the searcher database. The query results are kept in thedatabase if users continue to find the results relevant. If a certainthreshold (configurable at the system level) of users consider theresults not relevant or not satisfactory, then the results are no longeroffered to future users (and the results might be deleted from thedatabase).

If the query does not result in the use of previous search results, theprocess 190 of FIG. 3 continues and the keyword(s) of the current queryare used to search 192 the database 156 for keyphrases that match. Atthis time, the keywords can also be sent to a conventional searchengine, such as Google™, to have a conventional search performed, theresults of which are passed to the searcher accepting the search. In thedatabase search 192, for each keyword match, corresponding databaseentries, such as searcher identifiers, searcher success rate,availability, etc. are retrieved 194. The keywords found in the databaseaccess can be ranked according to the importance they should carry in asearch query phrase.

In this ranking a keyword such as “Reggie Miller” 210 (see FIG. 3A)might be ranked higher than a keyword such as “basketball” 212 because“Reggie Miller” is more specific. Therefore, generally, if a searcherhas signed up for a more specific keyword, then it is an object of thisinvention to have the more targeted searcher responding to the user'srequest. Hence, in a query such as “reggie miller basketball” 214, asearcher would be selected based on the higher ranking keyword 216 ofthe query, which is a searcher who has signed up for the “reggie miller”keyword, and therefore should have more targeted domain-specificknowledge about Reggie Miller than a searcher who signed up for thekeyword “basketball”. (An automated mechanism for ranking keywords isdescribed in a paragraph below.) Within the searcher pool 218 for akeyword, the searcher with the highest rank 219 would be chosen by thequery server 118 to receive the query. Also, words such as “a”, “an”,“the”, “is”, “what”, “why”, “how” might be given a low keywordimportance rating.

In any event, if there are multiple searchers in the pool representingthe highest-ranking keyword 210 for the query, then the highest rankedsearcher 219 of that pool 218 is selected first. The list of availablesearchers is sorted 196 according to one or more of the number ofkeywords of the query that match corresponding keywords of thesearchers, keyword rank, searcher rank, the success rating of thesearchers, etc.

If a searcher is signed up for multiple keywords in a query, (e.g. asearcher might be signed up for both “baseball” and “world series”),then that keyword searcher may take priority over fewer-keyword searchercandidates who are only signed up for fewer matching keywords in thesearch query phrase (e.g. a searcher who is signed up for either“baseball” or “world series” but not both).

If the query is a follow-on query (and the user has indicated a desireto have this searcher help with future searches in a particular keywordcategory), the “legacy searcher” should be ranked the highest in thelist. For the top ranked searcher, the query, including keywords, etc.is sent 198 (see FIG. 3) to his or her searcher tool system, for examplesystem 122 or 128. An alternative implementation could send the query tomultiple searchers 122-128 simultaneously to determine which availablesearcher will respond to the query most quickly. And similar to a gameshow, the first person to hit the “I'll handle the search” or “Accept”552 button “wins” the search. Or, alternatively, multiple searcherscould actually do all the searching work and multiple searchers' resultscould be returned to the user (even with multiple chat sessions betweenthe user and multiple searcher(s) still enabling clarification, etc.).If one or more keywords are not found in the database 156, the databaseis updated to include them and they are linked to the query. Searcherscan sign up for those keywords in the future.

If no searcher is identified for a query phrase, then the server caneither forward the query to “generalist searchers” who will attempt toanswer queries in any category. Alternatively, the system will shuttlethe query to another search engine and/or meta-search engine in anattempt to provide the user with a base level of functionality that isnever worse than other search engines. The results are passed back tothe user. Also, the query may be passed to a system of experts whoanswer questions on a website such as Google Answers or Yahoo Answers,and the user may be given a pointer to the location of the query whichmay be answered in the future. These systems may not give real-timefeedback, but the user may check back in the future.

Given that the system has stored the keywords, searchers can sign up forthose keywords in the future. The keyword database can be inspected bysearchers to determine the ranking, traffic, and searchers related toparticular keywords, which can further inform (and possibly motivate)searchers about signing up for keywords.

If the search is accepted 200 (FIG. 3) by one (or more) of thesearchers, the database is updated 202 to link the searcher to thequery, etc., indicate the searcher is unavailable while handling thisparticular query, etc. In the case where the query is sent to multiplesearchers, it is possible to configure the system to inform all of thecontacted searchers, except the first to accept the query, that thequery has been accepted by another searcher and indicate that theyshould discontinue their searching. These searchers are made “available”to other users' queries. Alternatively, it is also possible to let thesearchers who have accepted the query continue their search. If at leastone searcher is working on the search, a message is then sent 204 to theuser that indicates that the search is “in progress”. This message canalso be accompanied by other information, such as an advertisement. Thisadvertisement can be one selected by the query server 118 or oneselected by the searcher based on the query (and/or keywords) acceptedfor searching. If an advertisement suggested by the searcher is sent tothe user, the database is updated to (optionally) credit the searcherfor the advertisement being sent to the user.

In the case where individual searchers are attempted sequentially andthe currently-selected searcher does not accept the search (either bypressing a button to “reject” or by not responding within a(configurable) short period of time such as 6-18 seconds), the nexthighest ranked searcher is obtained 206 from the list and the query issent 198 to this next searcher. Since it may take more time than theuser is expecting to find a searcher in this situation, the server 118can also send additional information to the user, such as a game, avideo or another advertisement such as an interactive advertisement. Inany event, the user is or can be updated periodically to be made awareof the search progress.

If a searcher does not feel qualified to conduct a search that was sentto him/her, then it is generally better for the searcher to do a“transfer to another searcher” to expeditiously get the user betterresults from another qualified searcher. This creates a better userexperience. The searcher may be compensated in some way for choosing totransfer the question to another searcher. In some cases, thatcompensation for the original searcher may be gated by the success ofthe next searcher. However, if the search is handed off more than apreset number of times (e.g. 3 times), then the server preferably willreturn the “default” answer of one of the top search engines for thisquery string. This ensures that the user is receiving no worse resultsthan using one of the top search engines. The user may be able to selectwhich search engine is used as the “default”. This information may bestored on the user's local system (e.g. as a cookie) or if the user is“logged in” to the server, then user profile information may be keptthere. A gift certificate or prize may be awarded in this case in orderto encourage the user to continue using this human-assisted searchengine even though the human element of the search was not readilyavailable for this particular search. As mentioned already, the querymay also be passed to a question/answer website such as Google Answersor Yahoo Answers for an eventual answer to the query from an “expert”from those websites. The user would be given a link to the query at theother website.

If the end of the list (206) of potential searchers is reached, thesystem can check for additional searchers that have become availablesince the query was received and send them the query or can send thequery to an available searcher who has registered for general searches.Alternatively, the system can use a variety of mechanisms such as usingthesaurus-like relationships between words to send the user to asearcher that is signed up for a keyword pool that is deemed closest tothe user-entered keyword. The system may be configured to set thethreshold for the degree of closeness of the user-entered keyword versusthe search pool associated with a similar keyword. And as noted above,the results from a search engine can also be provided.

When search results are received from a searcher, the database 156 isupdated 232 (FIG. 4) to store the results linked to the keywords, thequery, the searcher, the time required for the search, etc. and theresults. If the system has been configured to allow multiplesimultaneous searches based on a query, and if this is a first set ofsearch results 233, the results are transmitted 234 to the user (whichis the case when the query is sent to only one searcher). For thetelephone-based user this may involve converting the results into audioinformation or transmitting the information to the user via a textmessage (or mail), or both. The transmitted text, audio or mail can alsoinclude an advertisement linked to the keywords or selected by thesearcher.

If it is the second set of search results, the search results can betemporarily stored 235 in a push down type results queue and the secondreplying searcher notified that their results are in a results waitingqueue.

If any result is returned, the system then waits for a reply 236. If thereply is that the user wishes to perform an entirely new query, thedatabase 156 is updated 238 to reflect a successful search and theprocesses of FIGS. 2 and 3 are executed for the new query. This updateupdates the query, keywords, results and credit to the searcher.

If the reply is an explicit acceptance, such as the user clicking theaccept button of the user GUI or the user logs out of the search system,the system updates 240 the database, deletes the contents of the queue,etc. The user can also be sent a message thanking the user for using thesystem and one or more advertisements linked to the search results. Thehuman searcher is notified of the user's acceptance of the results.

If the period for a reply times-out 242, indicating that the user hasmoved on, the system updates 240 the database 156 to reflect asuccessful search. The database entry for the human searcher is updated241 about the successful search. That is, the database 156 is updated toreflect a successful search having been accomplished by this humansearcher (allowing the human searcher to be credited “points”), linkingthe stored successful search results with the searcher and the query,keywords, etc. The human searcher may be notified that the user hasaccepted the results by default.

If the reply indicates that the user is requesting that the search beredone with the same query, the database is updated 244 to reflect anunsuccessful search, the search results are deleted 246 (or at aminimum, made unavailable in future searches although the results may bekept for auditing purposes) and the database entry for the searcher isupdated to reflect that the search was unsatisfactory for the user. Theoriginal searcher is notified that the results were not acceptable.Another searcher is engaged to perform a search for the query. This redoreply can also result in the system sending the user machine 202 amessage indicating the system is redoing the search, and information toentertain or engage the user, such as a video clip of a popular comedyor an advertisement that includes a discount coupon. This update 244updates the total number of searches by this searcher without updatingthe number of successful searches, deletes (or marks them as not to beused) the search results of this search, etc. If other search resultsare stored in the queue 248, the next entry is taken from the queue 250and transmitted 234. If no results are stored in the queue, the systemaccesses 206 the searcher list at the query server 118 for additionalsearchers and transmits 198 the query to the next-highest-rankedsearcher (or set of searchers).

If the reply is simply rejected, the database is updated 252 to reflectan unsuccessful search, the results are discarded 254 and the databaseentry for the searcher is updated 255 about the rejected search. Thatis, the total number of searches for this human searcher is updatedwithout updating the successful search total; any comments provided bythe user are linked to the searcher, etc. The human searcher may also benotified. The system can reply with a message apologizing for thefailure and some sort of inducement to use the system again, such as afree popular video, song, game, discount coupon, etc. A default set ofresults can be sent to the user from one of the top-ranked searchengines using the user's original query. The user may be able to specifywhat “default search engine” should be used in such cases.

When a clarification request is received from a searcher, such assearcher tool system 122, the clarification request is transmitted 282(FIG. 5) to the user, such as to system 102. This request can also besent to other searchers who have accepted the query. The clarificationrequest can be in the form of a digital message, such as an instantmessage (IM) or even an audio message, using a VOIP (Voice Over InternetProtocol) connection or using a speech message packet that can be playedby a user computer or telephone, for example. The system also checks therequest and the database 156 to determine 284 whether the searcherdesires to remain anonymous. If not, the searcher identity (emailaddress, name, etc.) is retrieved 286 from the database 156 andtransmitted 286 to the user.

The system then awaits a reply 288 from the user. The reply can be anewly constructed query and the system is updated 238 (FIG. 4), whichinvokes the process of finding a new searcher for the new query.However, the system is monitoring to see if a reformulated query issubmitted by the user that may cause the query server to send the newquery to the same searcher.

If the searcher receives the new query and determines that this newquery is outside his/her realm, the searcher can “transfer” the query toanother searcher, which sends the query back to the server to findanother searcher based on keywords, etc. . . (In general, the searchermay, at any time, choose to transfer the query to another searcher,which invokes a process as described further below).

The user reply can be a message that provides additional explanation tothe searcher. This clarification message is transmitted 290 to thesearcher. If multiple searchers have accepted the query, the system canprovide the clarification to all searchers. In fact, the system mayprovide the entire chat interaction to all participants (i.e. the userand one or more searchers). The system then checks 292 the originalquery and the database 156 to see if the User desires to remainanonymous and, if not, the user's address is also sent 294 to thesearcher. The system then awaits the results of a search or anotherclarification request. The system can allow the user and searcher tocommunicate independently for further clarification when they do notremain anonymous or all requests can be routed through the server 118either anonymously or fully identified or partially identified.

The searcher, once clarification is obtained can recognize that thequery is out of the searcher's search expertise and the searcher canindicate that the clarified query should be transferred to anothersearcher. As part of the transfer, the searcher can clarify the queryfor the next searcher (and for the user). The system, when such atransfer request is received 296, checks 298 to see if the transferincludes a searcher suggested query. If so, it is transmitted 300 to theuser and displayed as a revised query in the query frame or as a revisedquery in the clarification request/answer frames of the user GUI. Thequery is used to update the database, which includes removing the linkbetween the query and the searcher. Alternatively, the user may beallowed to approve 302 the modified query before it invokes a new searchwith the modified query. The searcher is permitted to transfer a querywithout incurring an update to the searcher's statistics that indicatethe searcher did not produce successful search results. That is, asearcher is not penalized for recognizing that they cannot handle thequery. The searcher has an incentive to pass along a query when he orshe does not feel qualified to perform a given search. If the user doesnot accept the revised query or the searcher did not produce one, thedatabase is updated 304 to mark the query as a transferred query, thelink to the searcher is removed and the list of searchers is accessed206 to find another searcher or set of searchers using the previouslydescribed process. In this event, the searcher is also not penalized.When the search is transferred, all of the “instant message” or “chat”interaction of the first searcher is transferred to the subsequentsearcher so that there is history and context that does not need to berepeated between the user and searcher.

When the “old” searcher has decided to transfer to a new searcher, theold searcher hits a “transfer” button 554 on the searcher tool screen550 (see FIG. 10B). The searcher may transfer the search to anothersearcher by selecting the keyword that seems most likely to havesearchers that will know the answer to the user's query. In other words,a human can determine what seems to be the most relevant keyword in thesearch query. When the searcher clicks the “transfer” button 554, a newdisplay 650 (see FIG. 10D) allows the searcher to perform the transferoperation. The query string is presented to the searcher 652 with allpertinent keywords displayed below the query string. For the examplequery of “world series winner 1960”, there might be keywords 653“world”, “series”, “winner”, “1960”, “world series”, and “world serieswinner” that searchers might have signed up for. By selecting keyword“world series winner”, the human searcher will likely select a searcherout of a pool 656 of two currently logged-in “world series winner”searchers who seem perhaps most qualified to find relevant resultsregarding winners of the World Series. By selecting this button 654, thehuman searcher effects a transfer to this new searcher pool. Whenchoosing a searcher that is most likely able to give good results, theoriginal searcher may also be rewarded if the subsequent search isconsidered successful by the user. The searchers are obtained 206 fromthe pool and the query is transmitted 198 to the searchers.

This “transfer” capability can be used to give keywords their ranking(see above regarding importance of having a ranking for keywords inorder to choose which pool of searchers to choose from during theinitial routing of a query to an appropriate searcher). If the initialsearcher (associated with an initial keyword) picks another keyword tosend with this query, then the weighting of the initial keyworddecreases and the importance of the new keyword increases. Therefore,over time, when these two keywords show up in the same query phrase, thehigher-weighted keyword selects for the searcher pool that will get theinitial attempt to perform the search. The weighting can be kept on aglobal basis, decrementing and incrementing the weightings no matterwhat are the keyword pairings. An alternative approach that takes moreresources but provides better results is to store keyword pairs andmonitor the weighting just within that specific pairing. An example ofthis might be, “How many police helicopter pilots are there in the NYCarea?” which might initially trigger a search performed by a searcherwho has signed up for the “police” keyword. However, over time, it mightbe that those searchers do not feel competent to deliver an answer sothey transfer to searchers linked to the “helicopter” keyword or“helicopter pilot” keyphrase keyword. Over time, the later words becomehigher weighted so that such a search would go to the “helicopter pilot”searchers first, rather than starting with the “police” searchers. Theinitial keyword weightings may be assigned based on keyword or wordfrequency of occurrence in web documents, search queries from othersearch engines, etc.

When a transfer of a query occurs, the system can send a message to theuser that another searcher is being sought to handle the query in orderto give the user better service. Of course, new information to entertainand/or engage the user, such as a different advertisement can also besent.

By having the system facilitate a dialog between the searcher and theuser through these operations allows the user to receive a higherquality and more rewarding search experience. And the dialog allows theuser to guide the searcher so that a better search result can beproduced. The dialog is preferably conducted through the server 118 or,alternatively, by a mechanism such as instant messaging directly betweentwo computers, telephones, or devices (or using a different server thanthe one provided by this service). The dialog may also occur viamechanisms such as VOIP, circuit-switched voice networks, or voicepacket networks.

When the end of a billing period is reached, the server accesses thedatabase 156 to obtain information associated with the success of thesearchers (e.g. relevance of the results to the end user), the number ofadvertisements, advertisements hand-selected by the searcher, the speedof response, etc. and applies a formula that takes these factors intoaccount in order to compute a remuneration for the searcher. The serveralso applies a formula to compute the advertising cost for theadvertisement (paid by the advertiser) that can take into account thenumber of times an advertisement has been presented, the length of timethe user watched the ad, whether the user “clicked through” the ad,whether the user bought products or services from the advertiser'swebsite (this information may be delivered back to the server from theadvertiser), etc. Appropriate payments to searchers and bills toadvertisers are then sent out. Searchers may receive their payment viaan “account” on the system until the searcher asks for a payout, whichmight occur via any form of payment or the searcher may chose to spendtheir points or dollars on products that are offered via the search toolsystem.

A user system, such as system 102, presents the user with a GUI 330 thebasic components of which are depicted in FIG. 6 while FIGS. 9A-9C showa possible layout other components and an example of use. The componentsof the GUI 330 include a frame (or field/window) for a query 332 and acontrol or button 334 to start a search. The user can also activate abutton 336 to signify that they do not want to remain anonymous to thesearcher, which prompts the user to login or to setup an account so thatlogins are possible. A progress frame 338 can be used to update the userconcerning the progress of the search. A results frame 340 displays theresults of the search and buttons are provided for accepting (342),rejecting (344) and redoing (346) the search. The text of the acceptbutton 342 may say “Would you like to do the exact search again with anew searcher?” and the buttons 344 and 346 may be eliminated. Aninformation frame 341 can also be provided for the information, such asan advertisement, provided to the user during the stages of the searchor the result frame 341 can be used for the presentation of theinformation (e.g. an advertisement). An exit button 350 is also providedwhich can result in log-off from the search system. When the searcherrequests clarification, the request is presented in frame 352 and theuser can enter the clarification in frame 354. The user sends theclarification by activating a send button 356 or by simply hitting“enter” on a PC keyboard, as would be done with a chat session. Thesearcher identification can also appear in frame 358. Alternatively,both the user's and searcher's comments may appear in the same frame,similar to the way many chat services are structured, designating eachperson's comments via a tag which could be their real identity, a userID, or a temporary ID.

The GUI 330 has an associated GUI data structure or database (not shown)that stores the contents of each of the buttons and frames or fields.For example, the data structure can store a flag indicating whether theuser is anonymous, whether a search has been requested, the contents ofthe clarification request frame, the content of the results frame, etc.This data structure is essentially duplicated in the database 156 of theserver 118 and when the database in the server is updated, the contentof the GUI data structure and GUI can also be updated. The entirecontents of the GUI data structure can be transmitted to the server 118each time a user activates a button and the server responds with anupdate to the GUI data structure (and GUI). The entire contents of theGUI data structure can also be updated when events occur at the server,such as when an advertisement is to be displayed. Alternatively andpreferably, to keep the user GUI simple, the system can only provide theframes and buttons, as they are needed. For example, until aclarification request is made, the GUI need not display the frames352/354 and button 356. To minimize any visual overload that may bepresented by the GUI and keep the presentation to the user simple whenthey first come to the website, only the search query frame 332 and the“search” button 334 may be initially presented to the user along with aminimal amount of text such as the title of the company (also see FIG.9A). Once the user has entered the query, then other frames may appearon the display such as the advertisement 341, progress indication 338,and the chat or clarification elements 352, 358, 354, 356 (also see FIG.9B). When the results are sent back, the results frame 340 may open andeither share space on the display or take the place of, theadvertisement. The buttons such as 342, 344, and 346 might appear alongwith the results (also see FIG. 9C). The exit button 350 and theidentify (or login or “anonymous”) button 336 may be displayed for theuser, depending on the service implementation.

The searcher tool system 122 incorporates a more sophisticated GUI 380and associated data structure. The components of the GUI are depicted inFIG. 7 while a possible layout of the basic components shown and othersamong screens are depicted in FIGS. 10A-10E. The GUI 380 allows thesearcher to review a query in a query frame 382 accept the query via a“accept” button 386, request clarification via a “chat” area 388 of thedisplay and a “send” button 390 to send a message to get clarificationfrom the user. The searcher can also drag/drop/paste search results withtext, pages, links etc. into a search result area 392 send the resultsvia button 394, select or designate an appropriate advertisement for aquery from an advertisement list that can be correlated to keywords orresults. The searcher can also indicate availability (“logged in andaccepting queries” or not) via the “available” button 398 and receivesystem messages in frame 400 such as that other searchers have alsoaccepted the query, the status of the results from other search enginesor websites where the query has been passed, the statistics of thesearcher such as the success rate, keywords registered by the searcherin the database 156. The GUI can also show the results of theconventional search engine search in frame 402. Other buttons or displayframes can include a request transfer of the same query or a clarifiedor searcher-rewritten query, an indication that a received query hasbeen transferred, turn on speech-enabled search capability so thatcellphone users (and other speech-oriented users of the system) mayaccess the speech-enabled searchers, and send voice messages to users,etc. using appropriate frames and button controls. This GUI could alsobe updated each time the searcher activated a button and each time theserver 118 updated database 156 entries associated with the searcherGUI. The query server 118 or the client side 122-128 may control the GUIusing a variety of implementation platforms including Flash, Flex, J2EE,XML, AJAX, Ruby, etc. The GUI also can have bookmarks, etc. for thesearchers favorite tools, databases, often used results, etc. The GUIcan provide sections of the screen that automatically fill with resultsof the query being passed to other search engines or websites andreturning results in those frames (or separate windows) without thesearcher needing to copy and re-enter the query. The searcher mayinteract with any of the search engines or websites independently untilthe searcher finds information that is highly relevant, which may thenbe selected, copied, and pasted into the results window. Once thecollection of data is accumulated in the results window, it may be sentto the user's “results” window or frame. This may be accomplished bycopying the data over the network from the searcher's results frame (orwindow) 392 to the user's results frame (or window) 340, which may needto be opened (and an advertising frame or window may be closedsimultaneously).

Alternatively, selected areas of the information being searched may bedragged and dropped to the results window by a mechanism similar toselecting a Google listing (or other search engine's listing) inMicrosoft Internet Explorer and dragging the listing paragraph toanother application such as Microsoft Word and dropping it there to haveit inserted. A similar mechanism would be used to drag a selectedlisting paragraph from search engine results frame 402 and drop theselected information into results frame 392.

Alternatively, an HTML or XML source interpreter may be implementedwhich interprets the source of the website or information that is beingaccessed and treats the selected area of the display as an objectcomprised of tagged sub-objects that can be more intelligently accessedby other applications. Each distinct search engine, website, or sourceof information may need its own form of translation in order to identifythe sub-components of the information that will be sent via thesearcher's results frame to the user's results frame. Tagged informationmight include elements such as title, description, URL, etc. . .

Typically, the searcher's and user's results frame would be filled withlinks that look similar to those of current search engines.Alternatively, actual text, graphics, audio, video, or other informationfiles may be returned by dragging and dropping to the results frame,similar to what is accomplished with operating systems such as Windowswhere files may be copied by dragging and dropping to another location.

The user-facing part of the system 102-112 preferably operates as a webapplication through a browser on a personal computer or as a voiceapplication through an interactive voice response system. Typically,this would be a thin client, getting most or all of its data via the webpage server, which can be a component of the query server 118. The queryserver might be one monolithic computer or it could be a distributednetwork of computers that slice up the processing of webpage serving, adserving, query and results search, database accesses, etc.Alternatively, the user-facing portion of the system may be a standaloneapplication or a part of a standalone application (e.g. implementedthrough an SDK).

The searcher-facing portion of the system 122-128 may also beimplemented as a browser-based thin client that allows all of thesignificant processing, data flow, various information sourceconnections, and data manipulation to occur at the server. However,preferably, because of scaling issues (i.e. handling very large volumesof users who each may require searchers to be checking many sources peruser), it is preferable to implement the searcher-facing portion of thesystem via a locally dynamic application that might run standalone ormight run in the context of a browser. There are many examples oflocally dynamic applications that do significant processing on theclient side (in this case, searcher side 122-128) while relying on datastructures that exist on a server (in this case, the query server 118which houses the database 156). Some examples of locally dynamicapplications include Google Earth (web-based mapping software),implemented using AJAX (Asynchronous Java combined with XML), andBasecamp (web-based project management software), implemented using“Ruby on Rails”.

The user- and searcher-facing parts of the system may be implementedusing these various mechanisms, but the heart of the system is in itsdatabase 156, which is preferably resident at the query server 118,which itself may be one or many computers working in harmony toimplement various data structures. FIG. 8 shows the relationships of thedata structure types. Primary data structure types are implemented forthe user, the searcher, the keyword, the query, the advertisement, thecategory, and the chat session. Within these primary structures, thereare pointing relationships to the other types. In this system, datastructures are comprised of single instances and/or lists of these datatypes. For example, each user is associated with a user data structure,which has local data such as IP address, start time, personal info anddemographics while also having pointers to the query that the user hasmade, a list of advertisements that the user has seen or is scheduled tosee, the chat session between the user and a searcher (or searchers), alink to the current searcher, and a list of favorite searchers thatmight be prioritized for this user in the future.

Similarly, the query structure has local data such as the query text andresults as well as pointers to keywords associated with the query, and achat session associated with the query.

Other relational connections are presented in FIG. 8 showing variousdata types of the database 156.

One example of the framework that may be used to implement thefunctionality includes having the searcher-facing part of the systemimplemented as a WinForm application using .NET 2.0 using C# withembedded Flash 8.0 elements for capabilities such as the chat sessionportion of the interface. The database may be implemented using SQLServer 2000. The user-facing part of the system can be a MicrosoftInternet Explorer running on a PC with the Flash 8 Plug-In.

An important feature of this invention is that information that islocated on the searcher's hard drive, intranet, or local environment maybe searched, for example using automated desktop search engines offeredby Google and others and/or via manual searching in a directory of ahard drive or on a local network. When relevant information is foundusing this method, the searcher may select, drag, and drop informationfrom this “local” source, but the referenced document must be copiedfirst to a publicly-available website, which is readily available viacompanies such as GoDaddy.com and others. When the searcher sets uptheir configuration, a public website (and login credentials) must beidentified to the searcher tool so that local data may be searched,copied to the public website, and referenced in the results with a linkto this publicly available website. Alternatively, the search systemitself may make files publicly available, on behalf of the searcher, atthe query server 118, at the searcher tool system 122, or elsewhere.

Files can be automatically transferred using a File Transfer Protocol(FTP) by the searcher tool system 122 to the public site, wherever it islocated. The reference pointer (i.e. URL) given to the user via theresults 484-486 will be to the material which has been copied to thepublic website where the searcher has permission to store documents (ofany form such as text, images, audio, video, etc . . . ).

This function of accessing the “Deep Web” (i.e. the very large volume ofdocuments and information that is not commonly available via the mostpopular search engines today) is accomplished by allowing the broad baseof searchers associated with keywords to have the ability to includematerials that are not readily indexed via traditional search engines(e.g. Google, Yahoo, MSN, AskJeeves, Dogpile, or others).

Searchers who sign up for particular keywords are motivated to collectexcellent resources in order to provide relevant answers quickly tousers. This increases the searcher's points and rank so that they may becompensated at a higher rate. Other searchers may be self-motivated toprovide excellent results because they have had a medical experiencethemselves and would like to help others in need of timely informationabout the same issue. Other searchers may have a passion for a hobbythat motivates them to make themselves available to help others inreal-time regarding that hobby.

The database 156 can include entries and a pointer-based structure asdepicted in FIG. 8. This data structure or database 156 includescross-linked entries for query, keyword, searcher, user, query,advertisement, categories, and chat session. Within these structures,there include entries for logged-in status of searcher (availability),rank (or weighting) of searcher, rank (or weighting) of keyword,searcher statistics such as number of searches, number of accepted (byuser) searches, user identification (and/or IP address of user), name,address, demographics about users and searchers, search results,advertisements (game, video, text, audio, etc.), advertisementstatistics, accounting information, anonymity flags for user andsearcher, searcher availability, query clarification and request (and/orchat session log), and an indication as to whether the searcher isavailable for general searches, query follow-on, etc. The statistics fora searcher can include the total number of searches, the number ofsuccessful searches, the average speed of the searcher, the latency ofthe searcher before starting and ending a search, the average number ofresults returned by the searcher, the availability time of the searcher,etc.

During a search sequence as depicted in FIGS. 9A-9C, when the user firstaccesses the search system web site, the user is presented with a queryGUI 460 in the browser window 461 (FIG. 9A). This GUI 460 includes aframe 462 where the user can enter a natural language query, keywords,etc. (that can be similar to what might be entered at the Google orAskJeeves websites). The GUI 460 also includes a search button 464 thatis activated when the user is ready to perform a search on the query.The query GUI 460 can also include controls 466 and 468 that canhighlight when the cursor passes over them and that when activated(“clicked-on”) will connect the user to a page that provides informationon becoming an advertiser and becoming a paid searcher, respectively.

After the user initiates the search with the button 464, the browserwindow is loaded with a search GUI 470 (FIG. 9B). This GUI 470 includesa frame 472 where the user is presented a message that indicates that asearcher will be provided shortly. The user is also presented anadvertisement in advertisement frame 474. There may be a variety offormats of advertisements. There may be multiple advertisements on thepage. When a searcher accepts the query, a message 474 indicates that asearcher has been assigned and when the searcher is not anonymous, thename of the searcher may be presented in the chat frame 476, perhapswith the searcher asking a clarifying question. Items that are typed bythe user 477 show up in the chat frame 476. A status frame 478 isupdated with the status and progress of the search as it changes. Whenresults become available, even though they may be preliminary, theresults can be presented in frame 480.

When the search is completed, the user is presented with a searchresults GUI 482 (FIG. 9C), that includes one or more search results 484and 486 that can include text descriptions, URLs, etc. When the user isnot satisfied with the search the user can request a new search byactivating “same search with new searcher” button 488. The user is alsoallowed to start a new search by entering a new query in frame 490 andactivating the search button 492.

FIG. 10A illustrates an example of a searcher login screen 500 which thesearcher sees after invoking the application but before being engaged inan actual search for a user. This screen 500 includes frames 502 for anelapsed time since the previous query. Also included is a frame 504 thatshows the searcher the list of keywords for which the searcher hascommitted to do searches. (During the first invocation of thisapplication, the searcher is preferably offered an online tutorial thatteaches how to sign up for keywords using this application as well astips about what keywords might be better choices). Preferably, thesearcher signs up for a short list (e.g. three) of keywords initiallyuntil the searcher proves that he or she provides timely and relevantresults (which will result in a higher ranking for the searcher). Thesearcher may sign up for more keywords by logging in and pressing the“sign up” button 508. Keywords will then be listed in frame 504 showingnot only the keyword but also the searchers ranking for that particularkeyword (e.g. “5/7” means that there are seven searchers who arelogged-in and who have signed up for this same keyword. Of those seven,this searcher is ranked fifth). A delete button 506 allows the searcherto delete any highlighted keywords from the searcher keyword list. Thesign-up button 508 allows the searcher to sign-up for additionalkeywords, preferably by opening up a new screen (see FIG. 10E as well asthe description below). The searcher can sign up for voice basedsearches using a check box 510 and a test button 512 allows testing ofthe voice components (speakers, microphone, etc.) needed for a voicequery. A configure button 514 allows the user to obtain a screen forconfiguring the searcher tool (see FIG. 10C).

FIG. 10B shows the query receipt screen 550 with the example query aboutthe World Series previously mentioned having been received by thesearcher in frame 382. The third party search engine results for thequery are shown in frame 402. The searcher's preferred third partysearch engine(s) may be chosen by the searcher (see FIG. 10C). A frame518 is provided that shows the searcher's favorite websites associatedwith the keyword that was used to select the searcher. The searcher mayselect these favorite websites in advance (see FIG. 10C). A local searchframe is provided allowing the searcher to check his or her own localhard drive or intranet to find relevant information related to theuser's query. Also, a frame 522 for a custom URL where the searcher mayenter any URL at all to access the entire web in order to find relevantresults on behalf of the user. The searcher can send partial searchresults or final results via buttons 524/526 and log out via button 528.When the searcher accepts the query, button 552 is selected. Thesearcher may choose to transfer the query to another searcher usingbutton 554 (also see FIG. 10D). The query time is displayed 556 showingthe searcher how long this query has been “live”.

FIG. 10C shows the searcher screen 600 used to configure the searchertool for particular keywords. This screen is reached by clicking on the“Configure” button 514 on searcher tool screen 500 (see FIG. 10A). Thesearcher can specify which search engines are used in frame 602 and thesequencing of the advertisements in frame 604 using up/down sequencebuttons 606. The searcher's favorite websites for finding informationabout the keyword can be listed in frame 608 and the listings can besequenced via up/down buttons 610.

FIG. 10D illustrates the screen 650 used to transfer a query to anothersearcher. The query is shown in frame 652 while the various componentkeywords 654 of the query are displayed in frame 653. Below eachcomponent keyword, the number of active searchers 656 for thekeywords/phrases of the query are shown. Buttons 662, 664 are alsoprovided that will allow the searcher to change the query, which willresult in new component keywords, etc. The searcher may cause a transferto occur by selecting the keyword button 654 that would likely result ina more successful set of results being returned for this query. Thesearcher may be compensated for transferring to a searcher that providesa successful result to the user.

FIG. 10E shows the screen 700 used by the searcher to sign-up forkeywords. Available keywords are listed in frame 702. “Availablekeywords” may include all known keywords, or during the system startupphase when searchers are just beginning to sign-up, the list may be acontrolled subset of keywords. For example, the system might start withonly the 500 most popular keywords used in searches by the generalpopulation. Or the system might offer keywords in a particular categorysuch as medicine or sports. This frame 702 shows the keyword, its weightwhich indicates the “strength” of this keyword when found in a searchquery phrase. (i.e. if a keyword has the most weight in a query phrase,then that keyword determines which searcher pool from which to find anavailable searcher)see FIG. 3A). The number of searchers signed up andlogged in for the keyword is also shown. The number of queries in thelast hour (or alternatively, last day, week, or any other period oftime) on the keyword is shown along with the ratio of queries tologged-in searchers. This data allows an experienced searcher tocarefully choose keywords that will result in the searcher being able toearn more searching opportunities and possibly a higher ranking.Providing this level of detail creates “efficiency” in the system,similar to what might be found on the trading floor of the stock market.

When a searcher discovers information that appears to satisfy the user'squery, such as a passage in a book on the users personal bookshelf, thepassage and possibly surrounding contextual material can be scanned inand posted on the searcher's public web site (as described earlier),assuming copyright laws are adhered to. The searcher can then providethe user with the passage of interest and a link to the website scannedversion, possibly a link to a neighborhood library that includes a copyof the book, and/or possibly a link to a bookseller's website (e.g.Amazon) where the book may be purchased. The search system can then addthis information to the database so it is accessible to the searcher forfuture searches and to users for whom the searcher is searching. Adesktop search capability may be installed as part of the searcher toolinstallation, which may be a local application running on the PC, abrowser-based application, or server-based application that presents itsinformation via a web-browser. Google Desktop Search is one suchexample.

To facilitate having searches performed by searchers who are experiencedin searching the subject matter of the queries, the searchers, when theyinitially register as a searcher in the system, select keywords orcategories of keywords that indicate their search expertise and/orexperience (see FIG. 10E). This set of keywords selected by a searchercan be updated as a searcher obtains a wider field of experience orsimply becomes more accustomed to using this system. The systemremunerates searchers for successful searches (e.g. which the user viewsas relevant and useful) and, as a result, it is expected that varioussearchers with a wide variety of search expertise will be logged in(available) to provide coverage at all times. The remuneration can bebased on the advertising revenue thereby providing an incentive to thesearcher to provide satisfactory results and, when given the option, toselect advertisements relevant to the search query, hopefully maximizingadvertising revenues. In addition, the remuneration may be based on theproportion of successful searches (accepted search results) and thisprovides the searchers an incentive not to accept searches that areoutside their field of search expertise. Or, if the searcher determinesthat he or she is not qualified to deliver a satisfactory result, thesearcher is motivated to “transfer” the query to another searcher whocan deliver a satisfactory result. If a query is transferred, thesearcher may receive some credit if the next searcher delivers asatisfactory result to the end user, thereby motivating the originalsearcher to carefully transfer the request (see FIG. 10D). The amount ofcredit may also be based on how quickly the searcher determines that atransfer is appropriate. This system also provides motivation for thesearcher to only sign up for keywords for which he or she can provide asatisfactory response to the end user in a timely fashion. A searcherneed not be an expert in the subject matter of the query but is expectedto be capable of locating information relevant to the query. The presentinvention will work best when the system has a large number of searchersthat are available 24 hours a day, providing coverage regarding anywherefrom a thousand (at system startup) to hundreds of thousands (or evenmillions) of keywords (a system that has evolved to have sufficientsearchers to cover the large number of keywords. To help insure thatsuch a mass of searchers sign-up to be paid searchers, the system cansplit the advertisement revenue with the searchers based on a formula aspreviously discussed. The system can also provide a different oradditional reward to searchers based on their relevance ranking. Therelevance ranking can include one or more that one factor, such asaverage search speed, number of accepted searches performed, number ofsearches performed, amount of cumulative time answering queriesregarding a particular keyword, number of keywords that they search,etc. However, it is preferred that the system provide a reward thatrewards the best searchers, is graduated, rewards a large number ofpeople, rewards a few with a very large reward, attracts mediaattention, engenders discussions among users and searchers of the systemwith other associates and contacts, can cause many searchers to competeto be the “best”, provides incentive for searchers to sign up tokeywords for which they can be particularly successful, and providesincentive for searchers to be logged in (available) as often aspossible. One example of such a reward system is a reward pyramid thatgives a few searchers a very large reward while many searchers receivesome reward. This mechanism can be used to convince a large number ofpeople to sign up as paid searchers. Such a pyramid might pay $1 millionto the top searcher during a period, $100,000 to the ten next bestsearchers, $10,000 to the hundred next best searchers, $1,000 to thethousand next best searchers, and $100 to the next best 10,000searchers. In this way, this particular bonus system involves 11,111people. The reward could be issued on a yearly, quarterly, monthly,weekly, or daily basis.

An alternative embodiment involves having a “PC anywhere” (remotecontrol) or WebEx (remote meetings) type of experience for the end userwho does not directly control the search screen but can watch what thesearcher is doing to accomplish his or her task. This allows the user tobe entertained, occupied, and engaged by what the expert searcher isdoing.

The user may comment in the “chat” frame in ways that allow for thesearch to be accomplished more collaboratively. For example, during asearch about the winner of the 1960 winner of the World Series, the usercould say via the chat screen (while watching what the searcher isreferencing): “What I really wanted to know was who was pitching for thewinning team in that game.” And the searcher could comply with thatclarified request.

An alternative embodiment allows a searcher to “see” unhandled queries.When a searcher logs into the system, the searcher can get access to alist of current queries and keywords that are associated with thequeries. The searcher can also see queries for which no search has beenaccepted after a predetermined period, such as 10 seconds, and acceptsuch a query, and such queries that are accepted and successfullysearched can be provided a higher rate of remuneration.

Rather than present the search results to the user one searcher set at atime, the search results of all searchers that perform a search on thequery can be presented to the user. This will increase the likelihoodthat relevant search results are presented to the user. The searchersinvolved in such a presentation would share the credit (remuneration)for a successful result. The system could also allow searchers to formsearcher groups that would facilitate such group results presentation.

A user could pay to subscribe to the search service and not be presentedwith advertisements.

If a searcher's “relevance rating” drops to a predetermined thresholdfor a particular keyword or across all his/her keywords, the searchercould be suspended (or permanently barred) from the system. There may beother reasons that a searcher gets suspended. For example, a user mayreport a searcher as being extremely rude, obnoxious, or inappropriatein their language or behavior, which could be reviewed by the servicemanagers or system administrators.

A user may also be cutoff from the service if he/she is being rude,obnoxious, or inappropriate. Because the identity of the user isoftentimes not known, the user would be cutoff by refusing packets froma particular IP address. If the behavior continued, the service managersor system administrator could take legal action. The response that theuser would receive to all queries would explain the consequences ofinappropriate behavior, including legal action.

Similarly, when a searcher abuses the system the searcher could becutoff. For example, if someone signed up as a searcher and provided“not relevant” results most of the time, across multiple keywords, thesystem could disable the searcher's account. The IP address could bemonitored as well.

Advertisements presented to a user can be of different lengths andsubjects based on the keywords of the query, the point of the searchcycle, the priority of advertisers as set by the system, the priority ofadvertisers as set by a searcher, etc. The database also includesinformation on the number of times an advertisement has been presentedto a given user (either an identified user or a user at a given IPaddress), the number of times users have linked to any web site noted inthe advertisement, etc. Advertisements may be managed via a product suchas “Macromedia Flash Media Server 2” and/or other products.

The keywords of the database can include all of the words of adictionary and groups of words that have an ordering. Keywords can alsobe weighted to allow them to be sorted higher in the ranking ofsearchers for receiving the query (see discussion related to FIG. 3B).Because it is more specific, the phrase “breast cancer” may be rankedhigher than the two words “breast” and “cancer”, so that the ranking of“breast cancer” searchers would not include searchers that specializedin searches of the words “breast” or “cancer” individually. That is,keywords or phrases that are often used for a particular type search canbe ranked higher in order to result in the selection of a searcher thathas a higher level of experience in that specific area of search.

The keyword/keyword database also indicates how many queries haveincluded a particular keyword, as well as how many searchers areassociated with that keyword. A ratio of queries versus associatedsearchers gives searchers the opportunity to find keywords that are morelikely to generate traffic for the searcher, which may increase thesearcher's income, if the searcher provides relevant results to the enduser.

The database also indicates how many times a searcher has searched aparticular keyword and how many times the searcher has been successfulfor the particular keyword.

Queries, associated keywords and corresponding answers can be removedfrom the database when they are no longer considered relevant. Acalculation of relevance can be performed every time that a new userreceives the “answer” and chooses to ask for another exact search(indicating a lack of useful data or relevance). If the user accessesthe answer and does not request another search with the same searchterms, then the original searcher who reported the answer is creditedwith points. If the user does ask for another search with the same (orpossibly similar) terms, then the searcher may have points deducted. Theratio of users who consider the answer relevant versus not relevant istracked. If this ratio hits a threshold, then the answer may be deletedfrom the system, or alternatively it can be saved for archival but notreported to future users who make the same (or a similar) query.

In another embodiment, it is possible for the server to host all of thelogic of loading and searching multiple search engines and websites inan ASP-type environment where most of the searching computation acrosssearch engines happens at the server. In the preferred embodiment, muchof the searcher computation is performed in a distributed way via thesearchers' computers.

In another embodiment, the searcher tool interface is defined in an“open” way so that third-parties may provide better and better tools,perhaps tailored for specific keywords, categories, or industriesincluding medicine, travel, shopping, etc. . .

In another embodiment, it is possible for a user's “default searchengine” to return results in a window frame while the searcher is doingmore extensive research and the user is presented with advertisements.This lets the user see some results as quickly as they would see themfrom one of the standard top search engines.

In another embodiment, harder queries can be sent to searchers who havesigned up for “paid search”. The queries are sent to the availablesearcher pool for a given keyword or set of keywords along with a bidfor how much would be paid if the query were answered within a specifiedperiod of time. The first searcher to “lock” the query can then spendwhatever time is necessary to answer the question and collect thepayment from the user. This differs from Google answers because there isa pool of searchers available at all times who are associated withspecific keywords.

There are many applications that can run better using this platform,creating a better user experience. For translating text from onelanguage to another, you would simply query: “translate from english tospanish ‘I love you’.” The expert searcher might be using a translatorservice such as altavista to get that answer. One nice thing is thatthose who are VOIP-capable would be able to hear the translation from anative speaker, in addition to getting the text translation.

With the present invention users get significantly improvedhighly-relevant search results from a broader base of information thancurrent search engines can index; keyword-targeted searchers are enabledwith powerful searcher tools that can adapt to the domain beingsearched; there is a process for having searchers compensated forhelping find the answers that provides motivation for a large pool ofsearchers to be available in a variety of domains of searchingexpertise; and advertisers get to have their (sometimes hand-picked) adsseen be a highly targeted audience.

The many features and advantages of the invention are apparent from thedetailed specification and, thus, it is intended by the appended claimsto cover all such features and advantages of the invention that fallwithin the true spirit and scope of the invention. Further, sincenumerous modifications and changes will readily occur to those skilledin the art, it is not desired to limit the invention to the exactconstruction and operation illustrated and described, and accordinglyall suitable modifications and equivalents may be resorted to, fallingwithin the scope of the invention.

1. A method of performing a search, comprising: receiving a query from aquery source; selectively including a keyword among a plurality ofkeywords based on a predetermined frequency of the keyword in a corpus;registering, by a searcher, for the keyword; selecting the searcherbased on a ranking of the searcher among searchers registered for thekeyword when determining that the keyword is a highest ranking keywordof the query; selecting the searcher based on a generalist ranking ofthe searcher when determining that the query does not indicate a keywordregistered by at least one searcher; conducting the search by thesearcher using a resource ranked highest by the searcher for conductingsearches; presenting search results to the searcher from a plurality ofresources selected based on the searcher, the searcher reviewing thesearch results from the resource ranked highest and the plurality ofresources and selecting a result considered optimal for the query; andsupplying the result to the query source subsequent to said reviewing bythe searcher.
 2. The method as recited in claim 1, wherein saidreceiving, selecting, conducting and supplying are performed inreal-time.
 3. The method as recited in claim 1, wherein said selectingcomprises searching a database for a searcher matching the query.
 4. Themethod as recited in claim 3, comprising: associating searchers with theplurality of keywords where said registering comprises comparingpopularity of keywords of the searcher to popularity of keywordsassociated with other searchers.
 5. A method of performing a search,comprising: associating human searchers with keywords and ranking thekeywords based on a count of the human searchers registered per keyword;ranking a first human searcher among the human searchers for thekeywords registered by the first human searcher; receiving a query froma query source; selecting a first human searcher ranked highest for ahighest ranking keyword of the query when determining that the keywordis the highest ranking keyword of the query; selecting the first humansearcher based on a generalist ranking of the first human searcher whendetermining that the query does not indicate a keyword registered by atleast one human searcher; presenting the query to the first humansearcher; selecting, by the first human searcher, a lower rankingkeyword of the query; selecting a second human searcher ranked highestfor the lower ranking keyword; selecting the second human searcher basedon a generalist ranking of the second human searcher when determiningthat the query does not indicate a keyword registered by at least onehuman searcher; presenting the query to the second human searcher toperform a search for the query and produce a search result; obtaining aplurality of search results for the query from search resourcesconfigured for the lower ranking keyword, the second human searcherselecting an optimal result of said plurality of search results;supplying the optimal search result to the query source; and increasinga rank of the lower ranking keyword in accordance with the selecting bythe first human searcher.
 6. The method as recited in claim 1, furthercomprising: ranking the searchers responsive to effectiveness and saidselecting of the searcher is based on the ranking responsive to theeffectiveness.
 7. The method as recited in claim 4, wherein saidselecting comprises identifying plural searchers and said presentingcomprises presenting a notification of the query to the plural searchersin an order based on a ranking of the plural searchers for the query. 8.The method as recited in claim 4, wherein said selecting comprisesidentifying a first single searcher and said presenting comprisespresenting the query to the first single searcher.
 9. The method asrecited in claim 8, wherein said selecting comprises identifying asecond single searcher after the first single searcher discontinued asearch.
 10. The method as recited in claim 7, wherein a first searcherto respond to the notification is exclusively allowed to perform thesearch.
 11. The method as recited in claim 1, wherein the resultscomprise one of a voice message, a text message, a graphics message anda uniform resource locator.
 12. The method as recited in claim 1,further comprising: determining whether the query has been previouslysearched; and providing previous search results responsive to thedetermining.
 13. The method as recited in claim 12, wherein saiddetermining comprises: comparing keywords of the query with keywords ofprevious queries; presenting a user with the previous queries havinglike keywords; and allowing the user to select one of the previousqueries.
 14. The method as recited in claim 13, wherein the comparingcomprises a fuzzy match.
 15. The method as recited in claim 13, whereinthe comparing comprises a partial match.
 16. The method as recited inclaim 1, wherein the query source comprises one of a user computersystem, a digital query source, a user application, a telephone, anautomated query source, a translation system and a speech query source.17. The method as recited in claim 1, further comprising transcribing aspeech query into a text query.
 18. The method as recited in claim 17,further comprising providing a voice message as the search results. 19.The method as recited in claim 1, wherein the query source comprises acellular telephone and the query comprises a text message.
 20. Themethod as recited in claim 19, wherein the results comprises a textmessage displayed by the cellular telephone.
 21. The method as recitedin claim 1, wherein the query source comprises a cellular telephone andthe results comprise one of a text message, graphics and a uniformresource locator displayed by the cellular telephone.
 22. The method asrecited in claim 1, wherein the query comprises a voice query and theselecting selects responsive to spoken keywords.
 23. The method asrecited in claim 1, further comprising transmitting messages between auser and a searcher concerning the query.
 24. The method as recited inclaim 23, further comprising providing a chat area for the messages. 25.The method as recited in claim 23, wherein the messages comprise voicemessages.
 26. The method as recited in claim 25, wherein thetransmitting comprises transmitting via a voice over internet protocolchannel.
 27. The method as recited in claim 23, further comprisingpresenting an advertisement during the transmitting.
 28. The method asrecited in claim 1, wherein either the user or the searcher can modifythe query during the search process.
 29. The method as recited in claim1, further comprising presenting an advertisement to a user during atime that the search is being performed.
 30. The method as recited inclaim 1, further comprising presenting one of an analog or digitaladvertisement to a user during a time that the search is beingperformed.
 31. The method as recited in claim 30, wherein the analogadvertisement is a spoken message.
 32. The method as recited in claim 1,further comprising presenting an advertisement to a user during thereceiving, selecting, presenting and supplying.
 33. The method asrecited in claim 29, wherein a searcher accepting a search querydesignates the advertisement.
 34. The method as recited in claim 29,wherein advertisers may bid for position and placement and timing ofadvertisements associated with keywords on a user's GUI.
 35. The methodas recited in claim 29, wherein advertisers may bid for position andplacement and timing of an advertisement associated with the keyword ona GUI used by the searcher to perform the search and the searcher canoptionally pick which advertisement is presented to the query source.36. The method as recited in claim 1, providing a reward to the searcherwhen determining that the result is accepted by a user.
 37. The methodas recited in claim 1, providing a reward to the searcher whendetermining that the result is not rejected by a user.
 38. The method asrecited in claim 1, wherein the selecting locates plural searchers forthe search, the presenting presents plural searchers with the query, andthe supplying supplies a first of the searchers' search results to theuser.
 39. The method as recited in claim 1, further comprising: locatingadditional searchers when the result is rejected by the user; andallowing the additional searchers to perform the search.
 40. The methodas recited in claim 6, wherein the searcher ranking is stored in adatabase and determines how the searcher will be utilized in futuresearches.
 41. The method as recited in claim 1, further comprisingallowing the searcher to transfer the query to a second searcher. 42.The method as recited in claim 41, wherein the transfer comprisesdesignating another keyword of the query and the second searcher is ahighest ranked searcher for the other keyword.
 43. The method as recitedin claim 6, wherein searcher ranking for a particular user can be set bythe particular user.
 44. A method of ranking keywords, comprising:determining a count of searchers signed up to conduct searchesresponsive to receipt of queries associated with a first keyword;ranking the first keyword based on the count of searchers; presenting aquery to a first searcher; determining a highest ranked keyword of thequery; selecting a highest ranked generalist searcher as the firstsearcher when determining that no searcher is associated with anykeyword of the query; selecting a highest ranked searcher for the firstkeyword as the first searcher when determining that the first keyword isthe highest ranked keyword of the query; selecting, by the firstsearcher, a second keyword of the query; selecting a second searcherbased on a rank of the second searcher for the second keyword;presenting the query to the second searcher to perform a search for thequery and produce a search result; supplying the search result to aquery source of the query; and adjusting a rank of the first keywordwhen determining that the first keyword is the highest ranked keyword orthe second keyword.
 45. A method, comprising: presenting a searcher witha query and allowing the searcher to produce search results for thequery based on a search conducted by the searcher, selecting anavailable searcher ranked highest for a highest ranking keyword of thequery as the highest ranking searcher; selecting an available searcherranked highest as a generalist searcher as the highest ranking searcherwhen determining that a searcher is not available for any keywords ofthe query; providing the query to the highest ranking searcher;selecting, by the highest ranking searcher, an alternate keyword of thequery; selecting another searcher ranked highest for the alternatekeyword as the searcher; providing the search results using a resourceassociated with a subject matter of the query by the searcher, thesearcher reviewing the search results prior to delivery and selecting aresult considered optimal for the query from among said search resultsand the searcher ranking the search results based on relevance to thequery; increasing the ranking of the alternate keyword relative to thehighest ranking keyword in a future query; and rewarding the searcherfor accepted search results.
 46. The method as recited in claim 45,wherein the reward is a pyramid reward.
 47. The method as recited inclaim 45, wherein the reward includes a graduated payment.
 48. Themethod as recited in claim 45, wherein the reward is determinedresponsive to searcher performance.
 49. The method as recited in claim45, wherein a searcher ranking is lowered responsive to non-acceptedresults.
 50. The method as recited in claim 29, wherein the presentingpresents a video advertisement.
 51. The method as recited in claim 50,further comprising allowing uploading video advertisements based onkeywords.
 52. The method as recited in claim 1, further comprising thesearcher performing a search of a local hard drive, a bookshelf and anon-public source.
 53. The method as recited in claim 1 furthercomprising: providing the search results in a designated web site; andproviding the user with a pointer to the designated web site.
 54. Asystem, comprising: a search system including a memory and a processor,the search system receiving a query from a query source, selectivelyincluding a keyword among a plurality of keywords based on apredetermined frequency of the keyword in a corpus, registering asearcher for the keyword, selecting the searcher based on a ranking ofthe searcher among searchers registered for the keyword when determiningthat the keyword is a highest ranking keyword of the query, selectingthe searcher based on a generalist ranking of the searcher whendetermining that the query does not indicate a keyword registered by atleast one searcher conducting the search by the searcher using aresource ranked highest by the searcher for conducting searches,presenting search results to the searcher from a plurality of resourcesselected based on the searcher, the searcher reviewing the searchresults from the resource ranked highest and the plurality of resourcesand selecting a result considered optimal for the query and supplyingthe result to the query source subsequent to said reviewing by thesearcher.
 55. A system, comprising: a search system including a memoryand a processor, the search system associating human searchers withkeywords and ranking the keywords based on a count of the humansearchers registered per keyword, ranking a first human searcher amongthe human searchers for the keywords registered by the first humansearcher, receiving a query from a query source, selecting a first humansearcher ranked highest for a highest ranking keyword of the query whendetermining that the keyword is the highest ranking keyword of thequery, selecting the first human searcher based on a generalist rankingof the first human searcher when determining that the query does notindicate a keyword registered by at least one human searcher, presentingthe query to the first human searcher, receiving a selection by thefirst human searcher of a lower ranking keyword of the query, selectinga second human searcher ranked highest for the lower ranking keyword,selecting the second human searcher based on a generalist ranking of thesecond human searcher when determining that the query does not indicatea keyword registered by at least one human searcher, presenting thequery to the second human searcher to perform a search for the query andproduce a search result, obtaining a plurality of search results for thequery from search resources configured for the lower ranking keyword,the second human searcher selecting an optimal result of said pluralityof search results, supplying the optimal search result to the querysource, and increasing a rank of the lower ranking keyword in accordancewith the selection by the first human searcher.
 56. A system,comprising: a search system including a memory and a processor, thesearch system determining a count of searchers signed up to conductsearches responsive to receipt of queries associated with a firstkeyword, ranking the first keyword based on the count of searchers,presenting a query to a first searcher, determining a highest rankedkeyword of the query, selecting a highest ranked generalist searcher asthe first searcher when determining that no searcher is associated withany keyword of the query, selecting a highest ranked searcher for thefirst keyword as the first searcher when determining that the firstkeyword is the highest ranked keyword of the query, receiving aselection by the first searcher of a second keyword of the query,selecting a second searcher based on a rank of the second searcher forthe second keyword, presenting the query to the second searcher toperform a search for the query and produce a search result, supplyingthe search result to a query source of the query, and adjusting a rankof the first keyword when determining that the first keyword is thehighest ranked keyword or the second keyword.
 57. A system, comprising:a search system including a memory and a processor, the search systempresenting a searcher with a query and allowing the searcher to producesearch results for the query based on a search conducted by thesearcher, selecting an available searcher ranked highest for a highestranking keyword of the query as the highest ranking searcher, selectingan available searcher ranked highest as a generalist searcher as thehighest ranking searcher when determining that a searcher is notavailable for any keywords of the query, providing the query to thehighest ranking searcher, receiving a selection by the highest rankingsearcher of an alternate keyword of the query, selecting anothersearcher ranked highest for the alternate keyword as the searcher,providing the search results using a resource associated with a subjectmatter of the query by the searcher, increasing the ranking of thealternate keyword relative to the highest ranking keyword in a futurequery, and rewarding the searcher for accepted search results; and asearcher system including a memory and a processor, the searcher systemreviewing the search results prior to delivery, selecting a resultconsidered optimal for the query from among said search results, andranking the search results based on relevance to the query.